home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.c
- Path: netcom.com!potter
- From: potter@netcom.com (David Potter)
- Subject: Re: Hashing help
- Message-ID: <potterDL8usx.G60@netcom.com>
- Organization: NETCOM On-line Communication Services (408 261-4700 guest)
- References: <4d9b67$gjk@news.trytel.on.ca>
- Date: Mon, 15 Jan 1996 22:36:33 GMT
- Sender: potter@netcom21.netcom.com
-
- In article <4d9b67$gjk@news.trytel.on.ca>, John H <johnh@trytel.com> wrote:
- >I've got a C clone compiler to build where I require storing the
- >lexemes (tokens) in a hash table. I've been struggling with the
- >source code for the table (tree). If anyone could help me I
- >will be forever grateful.
- >
- >John H
- >mailto:johnh@trytel.com
-
- There is a good book on Coalecse Chain Hashing by Jeffery Vitter.
- I no longer have a better reference for this book.
-
- Coalecse chains are better than other forms on collision resolution
- because look-up performance does not degrade as the hash table gets
- full.
-
-
- --
- David Potter, Open System Performance, Inc., (916)987-7531
- potter@osperf.com
-